منابع مشابه
From geometry to invertibility preservers∗
We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in
متن کاملInvertibility Methods in Constructive Geometry
Let us suppose T ( π, 1 2 ) ∼ √ 2 −9 + 1 ∨ · · · × 1± β 6= W (p× 1) tan−1 (−1) × · · · ∩Nq̃
متن کاملTesting from a Finite-State Machine: Extending Invertibility to Sequences
When testing a system modelled as a nite state machine it is de sirable to minimize the e ort required Yang and Ural demon strate that it is possible to utilize test sequence overlap in order to reduce the test e ort and Hierons represents this overlap by us ing invertible transitions In this paper invertibility will be extended to sequences in order to further reduce the test e ort and encapsu...
متن کاملLinear Size Distance Preservers
The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...
متن کاملPerfect Matching Preservers
For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2006
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm174-1-8